package dp.findSubstringInWraproundString;
/**
 * @Date 2020/04/27
 * @author 王光浩
 * @Need 
 * Consider the string s to be the infinite wrap around string of "abcdefghijklmnopqrstuvwxyz",
 *  so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".
Now we have another string p. Your job is to find out how many unique non-empty substrings of 
p are present in s. In particular, your input is the string p and you need to output the number of
 different non-empty substrings of p in the string s.
 */
public class Introduction {
}
